|Course 08: Theory of Computation (ArsDigita University)|
A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course...
Downloads: 78,287 (8 reviews)
|Course 05: Algorithm Design and Analysis (ArsDigita University) - ArsDigita University|
In this course design and analysis of algorithms is studied. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Their applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. We study algorithm analysis - worst case, average case, and amortized, with an emphasis on the close connection between the time complexity of an algo...
Keywords: algorithms; algorithm design
Downloads: 68,631 (8 reviews)
|Course 02: Discrete Mathematics (Arsdigita University)|
This course covers the mathematical topics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis is placed on providing a context for the application of the mathematics within computer science...
Keywords: ars digita; computer science; discrete math; logic; proof techniques; recurrence relations; basic set theory
Downloads: 55,669 (15 reviews)